Some polynomially solvable subcases of the detailed routing problem in VLSI design
نویسنده
چکیده
منابع مشابه
Improving Size-bounds for Subcases of Square-shaped Switchbox Routing1
Various problems are studied in the field of detailed VLSI routing. According to the position of the terminals on the outer boundaries of a rectangular grid, one can distinguish between different subcases of Switchbox Routing: C-shaped, Gamma, Channel and Single Row Routing. This paper focuses on the minimum number of layers needed for solving these problems either in the Manhattan, or in the u...
متن کاملA catalog of Hanan grid problems
We present a general rectilinear Steiner tree problem in the plane and prove that it is solvable on the Hanan grid of the input points. This result is then used to show that several variants of the ordinary rectilinear Steiner tree problem are solvable on the Hanan grid, including | but not limited to | Steiner trees for rectilinear (or iso-thetic) polygons, obstacle-avoiding Steiner trees, gro...
متن کاملAn Effective Memetic Algorithm for Solving Channel Routing Problems
The task of VLSI physical design is to produce the layout of an integrated circuit. The layout problem in VLSI-design can be broken up into the subtasks partitioning, floor p lanning, placement and routing. Routing can be classified into two types. One is Global routing and another one is detailed routing. In detailed routing, the Connections between blocks or cells, respectively, have to be ge...
متن کاملOn the Crossing Distribution Problem in Two Regions
VLSI layout design is typically decomposed into four steps: placement, global routing, routing region definition and ordering, and detailed routing. The crossing distribution problem occurs prior to detailed routing, in which crossings of nets are distributed according to design constraints. In this paper, we propose an O(nlog n) time algorithm for the crossing distribution problem for two-term...
متن کاملA Sub-Quadratic Algorithm on the Crossing Distribution Problem
VLSI layout design is typically decomposed into four steps: placement, global routing, routing region definition, and detailed routing. The crossing distribution problem occurs prior to detailed routing[1][2][3][4]. It is much more difficult to rout nets with crossings than not. We will use at least two layers to implement and require some vias. So the crossing distribution problem (CDP) is a v...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 115 شماره
صفحات -
تاریخ انتشار 2001